1 2 Ju n 20 01 A lemma on a total function defined over the Baker – Gill – Solovay set of polynomial Turing
نویسندگان
چکیده
We prove here a lemma that connects some properties of the so–called “counterexample function” to the P = NP conjecture over the Baker– Gill–Solovay set of polynomial Turing machines to the behavior of the same function “at large,” over the set of all polynomial Turing machines. ∗Partially supported by FAPESP and CNPq. Alternative address for F. A. Doria: Research Center for Mathematical Theories of Communication and Program IDEA, School of Communications, Federal University at Rio de Janeiro, Av. Pasteur, 250. 22295–900 Rio RJ Brazil.
منابع مشابه
Simplicity, Immunity, Relativizations and Nondeterminism
The relation between classes of languages recognized by resource bounded Turing machines remains an evasive subject in computational complexity theory. Especially results settling relationship between deterministic and nondeterministic complexity classes are rare. The interesting case of the relation between the classes of languages recognized by polynomial time bounded deterministic versus pol...
متن کاملDerandomization and Circuit Lower Bounds
1 Introduction Primality testing is the following problem: Given a number n in binary, decide whether n is prime. In 1977, Solovay and Strassen [SS77] proposed a new type of algorithm for testing whether a given number is a prime, the celebrated randomized Solovay-Strassen primality test. This test and similar ones proved to be very useful. This fact changed the common notion of " feasible comp...
متن کاملOn a Total Function Which Overtakes All Total Recursive Functions. *
We discuss here a function that is part of the folklore around the P =?N P problem. This function g * is defined over all time–polynomial Turing machines; we trivially change it into a g which is defined over all Turing machines, and show that g overtakes all total recursive functions. We then show that g is dominated by a generalized Busy Beaver function.
متن کاملSolovay's theorem cannot be simplified
In this paper we consider three potential simplifications to a result of Solovay’s concerning the Turing degrees of nonstandard models of arbitrary completions of first-order Peano Arithmetic (PA). Solovay characterized the degrees of nonstandard models of completions T of PA, showing that they are the degrees of sets X such that there is an enumeration R ≤T X of an “appropriate” Scott set and ...
متن کامل3 Switching Lemma
Why do we care about random oracles? It goes back to computability theory. Many results including halting problems, R vs RE, and etc., were based on black-box simulations and the existence of universal machine. This includes clever methods such as diagonalization. People thought that the same technique would work for complexity theory, for example, P versus NP problem. An oracle machine is a Tu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008